Random Sampling Techniques in Parallel Computation

نویسنده

  • Rajeev Raman
چکیده

Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in practice. We will focus on the use of random sampling in fundamental problems such as sorting, selection, list ranking and graph connectivity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Sampling: Sorting and Selection

Random sampling techniques have played a vital role in the design of sorting and selection algorithms for numerous models of computing. In this article we provide a summary of sorting and selection algorithms that have been devised using random sampling. Models of computations treated include the parallel comparison tree, the PRAM, the mesh, the mesh with fixed, reconfigurable, and optical buse...

متن کامل

Exploring Hybrid Monte Carlo in Bayesian Computation

Hybrid Monte Carlo (HMC) has been successfully applied to molecular simulation problems since its introduction in the late 1980s. Its use in Bayesian computation, however, is relatively recent and rare (Neal 1996). In this article, we investigate statistical models in which HMC shows an edge over the more standard Monte Carlo techniques such as the Metropolis algorithm and the Gibbs sampler. Th...

متن کامل

Load Balancing Techniques for Scalable Parallelization of Sampling-Based Motion Planning Algorithms

Motion planning, which is the problem of computing feasible paths through an environment for a movable object, has applications in many domains ranging from robotics, to intelligent CAD, to protein folding. The best methods for solving this PSPACE-hard problem are so-called sampling-based planners. Recent work introduced uniform spatial subdivision techniques for parallelizing sampling-based mo...

متن کامل

Parallel Processing of Chemical Information in a Local Area Network - III. Using Genetic Algorithms for Conformational Analysis of Biomacromolecules

Multi-dimensional nuclear magnetic resonance experiments are an excellent means of revealing the three-dimensional structure of biomacromolecules in solution. However, the search space in the conformational analysis of biomacromolecules, using multi-dimensional NMR data, is huge and complex. This calls for global optimization techniques with good sampling properties. This paper describes a gene...

متن کامل

A Martingale Control Variate Method for Option Pricing with Stochastic Volatility

A generic control variate method is proposed to price options under stochastic volatility models by Monte Carlo simulations. This method provides a constructive way to select control variates which are martingales in order to reduce the variance of unbiased option price estimators. We apply a singular and regular perturbation analysis to characterize the variance reduced by martingale control v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998